Program Transformation for Non-interference Verification on Programs with Pointers
نویسندگان
چکیده
Novel approaches for dynamic information flow monitoring are promising since they enable permissive (accepting a large subset of executions) yet sound (rejecting all unsecure executions) enforcement of non-interference. In this paper, we present a dynamic information flow monitor for a language supporting pointers. Our flow-sensitive monitor relies on prior static analysis in order to soundly enforce non-interference. We also propose a program transformation that preserves the behavior of initial programs and soundly inlines our security monitor. This program transformation enables both dynamic and static verification of non-interference.
منابع مشابه
Analysis and Verification of Pointer Programs
Graphs and their Transformation Arend Rensink, University of Twente, Enschede, The Netherlands The data structures built up in pointer programs can for many purposes be viewed as graphs, where the nodes are records and the edges are pointers. The manipulation of that data by a program then corresponds to the transformation of such a graph.
متن کاملPredicate Pairing for Program Verification
It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for constrained Horn clauses (or CHC solvers) based on predicate abstraction are sometimes unable to verify satisfiability because they look for models that are definable in a given cla...
متن کاملProgram Construction and Verification Components Based on Kleene Algebra
Variants of Kleene algebra support program construction and verification by algebraic reasoning. This entry provides a verification component for Hoare logic based on Kleene algebra with tests, verification components for weakest preconditions and strongest postconditions based on Kleene algebra with domain and a component for step-wise refinement based on refinement Kleene algebra with tests. ...
متن کاملProgram Analysis Techniques for Efficient Software Model Checking
Making software reliable is one of the most important technological challenges facing our society today. Software model checking offers a promising approach to address this problem. It is a formal verification technique that exhaustively tests a program on all possible inputs up to a given size and on all possible non-deterministic schedules, but does so cleverly by detecting similarities in th...
متن کاملRelational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterference, a well-known program property in the field of language-based security, and code transformations. Contrary to previous type systems for non-interference, no restrictions are imposed on the control flow structure of p...
متن کامل